ARAMYS - A Bit - Serial SlMD - Processor for Fast Parallel Nearest Neighbor Search and Associative Processing

نویسندگان

  • Peter WINDIRSCH
  • Manfred GLESNER
چکیده

In this paper we report on the VLSI-implementation of a processor for competitive neural networks and its prototype implementation. The basic element of our SIMD-processor architecture are dedicated bit-serial processing elements that allow vector comparison using binary or integer metrics and support fast parallel minimum search. An AS|C with 32 processing elements was implemented. Systems with up to several thousand neurons can be implemented with our architecturefor applications as image coding, classification and associative processing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FPGA Implementations of a Parallel Associative Processor with Multi-Comparand Multi-Search Operations

Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, graph theory and list/matrix computations. In this paper we report new FPGA implementations of a multi– comparand multi–search associative processor. The architecture of the processor working in a combined bit– serial/bit...

متن کامل

Device and Novel Architecture LSIs A Memory - based Parallel Processor for Vector Quantiza - tion : FMPP - VQ

We propose a memory-based processor called a Functional Memory Type Parallel Processor for vector quantization (FMPPVQ). The FMPP-VQ is intended for low bit-rate image compression using vector quantization. It accelerates the nearest neighbor search on vector quantization. In the nearest neighbor search, we look for a vector nearest to an input one among a large number of code vectors. The FMPP...

متن کامل

An FPGA Implementation of a Multi-comparand Multi-search Associative Processor

The multi-comparand associative search paradigm is shown to be efficient in processing complex search problems from many application areas including computational geometry, graph theory, and list/matrix computations. In this paper the first FPGA implementation of a small multi-comparand multi-search associative processor is reported. The architecture of the processor and its functions are descr...

متن کامل

Nearest Euclidean Distance Search Associative Memory for High-Speed Pattern Matching

A mixed digital-analog associative memory for Euclidean distance search with fully-parallel processing is reported. Digital processing is used up to subtraction and absolute value calculation in the vector-component comparator part. Analog processing is then applied up to completion of the winner-take-all function. The maximum search time of a test implementation in 0.35 μm CMOS technology havi...

متن کامل

An Associative Processor for Multi-Comparand Parallel Searching And Its Selected Applications

In this paper a multi-comparand associative processor is presented. The structure of the processor and its functions are described in detail. The processor works in a combined bit-serial/bitparallel mode. Its main component is a multicomparand associative memory with programmable prescription functions. The multi-comparand associative search paradigm is shown to be e ective in processing comple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008